polynomial computer
英 [ˌpɒli'nəʊmiəl kəmˈpjuːtə(r)]
美 [ˌpɑli'noʊmiəl kəmˈpjuːtər]
网络 多项式计算机构; 多项式计算机
双语例句
- A new lattice polynomial perceptron ( LPP) model is derived, which is very suitable for VLSI implementation. Computer simulations have been carried out and the experimental results are given.
导出了便于VLSI实现的多项式感知器的格型实现算法，进行了计算机模拟，并给出了相应的数值结果。 - At present nearly all systems of polynomial manipulation are written by LISP or FORTRAN, and run on a serial computer.
目前的多项式处理系统均采用表加工语言LISP或科学计算语言FORTRAN等，在一般串行机上实现。 - Fast Polynomial Transforms and It's Implemetation on General Computer
快速多项式变换（FPT）及其在计算机上的实现 - SAT problem belongs to the NP class, that is, theoretically it can't be solved in polynomial time and solving it exceeds the capability of modern computer.
SAT问题是NP完全问题，从理论上说，SAT问题不能在多项式时间内解决，它超出了现代计算机的能力。 - We summarized many different methods which to calculate the polynomial factorization, and studied the factoring of xn-1, and debugged successful a procedure on the computer.
综述了多项式分解的几种方法，并对x~n-1的分解进行了研究，依此提出新算法并编程实现。 - On the basis of this, the problem of finding out roots of a linearized polynomial is changed into the problem of solving a simple equation in a finite field. Because of this, it is convenient for a computer to find out roots of a linearized polynomial.
在此基础上，将线性化多项式根的求解问题归结为有限域上简单方程的求解，使得可以方便地用计算机求解线性化多项式的根。 - In this paper, the author presents a method of Chebyshev approximate polynomial for analysing nonlinear circuit as well as an example of its computer realization.
本文介绍用切比雪夫逼近多项式分析非线性电路的方法以及用计算机实现的例子。 - Some exponential algorithms problems in quantum computers can be resolved in polynomial algorithms in the duality computer and the computational complexity can be decreased.
与量子计算机相比，波粒二相机使得在经典上需要指数步完成的算法，在多项式时间内就可以解决，减少了计算复杂度。 - This paper briefly describes the algorithms for two-dimensional circular convolution computation using fast polynomial transforms ( FPT), and an improved algorithm is presented. Corresponding computer programs are implemented.
本文简单介绍利用快速多项式变换（FPT）计算二维循环卷积的算法，并提出一种改进算法。 - This paper gives an automated method for determining the property ( positive definite, negative definite, positive semi-definite, negative semi-definite or indefinite) of a binary polynomial, and its efficiency is demonstrated by computer implementation.
本文给出判定二元多项式性态（正定，负定，正半定，负半定或不定）的一种自动化方法，其有效性已在计算机实现中得到验证。 - In this paper we give an algorithm to decompose the zeros of a polynomial ascending set over retional field or prime fields of positive characteristics into irreducible components, which can be realized on computer by the software package ″ wsolve ″ of D. K.
对有理数域或特征为正的素域上的多项式升列，给出了把它的零点集分解为不可约分支的算法.该算法可以在计算机上用王定康的软件包wsolve实现。 - This paper presents a new method of polynomial munipulation, which is done in a pipeline computer by using the vector language of a sparse vector.
本文提出用处理稀疏向量的向量语言作为工具，在流水线向量机上实现多项式的处理。 - An Analytical algorithm of polynomial Integration in an Elliptical Area Based on REDUCE System of IBM-PC computer
微机REDUCE上椭圆域多项式二重定积分的算法 - A exponential polynomial fitting on cavitation curve of a pump is set up to calculate NPSH more reasonably and to make a computer deal with the test data of a pump cavitation more accurately and reliably.
提出了一种水泵汽蚀试验数据的拟会方法，较为合理地确定临界汽蚀余量，使得用计算机处理汽蚀试验数据更为准确、可信。 - By utilizing the theory about the rational subspaces and the minimal polynomial basis and then estimating the instantaneous correlation matrix, this technique can identify the channel coefficients and accomplish the blind equalization. Computer simulations can prove its effectiveness.
利用有理子空间及最小多项式基理论，通过估计瞬时相关矩阵，辨识出信道因数，完成系统盲均衡。 - In this paper the rational interpolation method is used as the delay angle account method. Compare with the polynomial approach this method is proved to be more accurate by computer simulation and their amount of calculation is equal.
作者采用了有理插值法作为晶闸管触发控制角的计算方法，通过仿真表明该方法与多项式逼近相比，计算量相当，但精度大大提高。 - Computing the characteristic polynomial or the minimal polynomial of a polyno-mial matrix is a basic problem in computer algebra, but it lacks of effective algorithms.
计算多项式矩阵的特征多项式或最小多项式是计算机数学领域中一个基本问题，尚缺乏有效的算法。 - Solving polynomial systems is a classical problem, while finding all the solutions of polynomials systems is hard and important problem in computer algebra and computa-tional mathematics.
解多项式方程组是一个经典的数学问题，而求多项式方程组全部解是计算机数学和计算数学领域中一个重要而困难的问题。